- graph-scheme
- Техника: граф-схема
Универсальный англо-русский словарь. Академик.ру. 2011.
graph-scheme
Смотреть что такое "graph-scheme" в других словарях:
graph — n *chart, map Analogous words: plot, scheme, design, *plan: diagram, outline, sketch (see under SKETCH vb) graph vb chart, map (see under CHART n) Analogous words: see those at GRAPH n … New Dictionary of Synonyms
Graph partition — The graph partitioning problem in mathematics consists of dividing a graph into pieces, such that the pieces are of about the same size and there are few connections between the pieces.Consider a graph G(V,E), where V denotes the set of vertices… … Wikipedia
scheme — Synonyms and related words: Byzantine intrigues, action, anagnorisis, angle, approach, architectonics, architecture, argument, arrangement, art, artful dodge, artifice, atmosphere, attack, background, backstairs influence, bag of tricks, blind,… … Moby Thesaurus
graph — Synonyms and related words: alphabetic character, black and white, blueprint, brouillon, cartoon, catalog, catalogue raisonne, character, charcoal, charcoal drawing, chart, chiaroscuro, cipher, copy, crayon, delineation, design, device, diagram,… … Moby Thesaurus
Distance-regular graph — Graph families defined by their automorphisms distance transitive distance regular strongly regular … Wikipedia
Code-O-Graph — The Code O Graph is a field cipher device and identifier from the Captain Midnight radio serial. In the story line they were used by agents of the Secret Squadron, a paramilitary organization headed by Captain Midnight. In addition to their use… … Wikipedia
Scene graph — A scene graph is a general data structure commonly used by vector based graphics editing applications and modern computer games. Examples of such programs include AutoCAD, Adobe Illustrator, Acrobat 3D, OpenSceneGraph and CorelDRAW.The scene… … Wikipedia
Degeneracy (graph theory) — In graph theory, a k degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph s edges. The degeneracy of a graph is the smallest… … Wikipedia
Quantum graph — In mathematics and physics, a quantum graph is a linear, network shaped structure whose time evolution is described by a system of schrödinger equations or, more generally, by a set of evolution equations associated with differential or pseudo… … Wikipedia
Matching (graph theory) — In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. It may also be an entire graph consisting of edges without common vertices. Covering packing dualities… … Wikipedia
Algebraic graph theory — is a branch of mathematics in which algebraic methods are applied to problems about graphs. In one sense, algebraic graph theory studies graphs in connection with linear algebra. Especially, it studies the spectrum of the adjacency matrix, the… … Wikipedia
